Two simple algorithms for discrete rational approximation
نویسندگان
چکیده
منابع مشابه
Discrete Rational Lp Approximation
In this paper, the problem of approximating a function defined on a finite subset of the real line by a family of generalized rational functions whose numerator and denominator spaces satisfy the Haar conditions on some closed interval [a, b] containing the finite set is considered. The pointwise closure of the family restricted to the finite set is explicitly determined. The representation obt...
متن کاملComparison of Algorithms for Multivariate Rational Approximation
Let F be a continuous real-valued function defined on the unit square [—1,11 x [-1, 1]. When developing the rational product approximation to F, a certain type of discontinuity may arise. We develop a variation of a known technique to overcome this discontinuity so that the approximation can be programmed. Rational product approximations to F have been computed using both the second algorithm o...
متن کاملApproximation Algorithms for Discrete Polynomial Optimization
In this paper, we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete (typically binary) variables. Such models have natural applications in graph theory, neural networks, error-correcting codes, among many others. In particular, we focus on three types of optimization models: (1) maximizing a homogeneous polynomial function in binary variable...
متن کاملApproximation Algorithms for Steiner Augmentations for Two-connectivity Approximation Algorithms for Steiner Augmentations for Two-connectivity
We consider the problem of increasing the connectivity of a given graph to two at optimal cost. Fredrickson and Ja'Ja' 6] showed that that this problem is NP-hard and provided approximation algorithms. Recently, Khuller and Thurimella 7] have extended these results and presented a more eecient version of the results in 6]. We consider an extension of this problem to a more general setting. In t...
متن کاملA Comparison of Algorithms for Rational / œ Approximation
Results are reported of a numerical study to compare eight algorithms for obtaining rational L approximations. The algorithms investigated are Loeb's algorithm, the linear inequality algorithm, the Osborne-Watson algorithm, the differential correction algorithms I, II and III, the Remes algorithm and Maehly's algorithm. The results of the study indicate that the Remes algorithm and the differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1970
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1970-0301894-x